Nuprl Lemma : p-disjoint_wf
11,40
postcript
pdf
A
,
B
:Type,
f
,
g
:(
A
(
B
+ Top)). p-disjoint(
A
;
f
;
g
)
latex
Definitions
Type
,
t
T
,
Top
,
left
+
right
,
x
:
A
B
(
x
)
,
Void
,
x
:
A
.
B
(
x
)
,
x
:
A
.
B
(
x
)
,
S
T
,
suptype(
S
;
T
)
,
can-apply(
f
;
x
)
,
b
,
x
:
A
B
(
x
)
,
,
P
&
Q
,
A
,
p-disjoint(
A
;
f
;
g
)
Lemmas
not
wf
,
assert
wf
,
can-apply
wf
,
top
wf
origin
A, B:Type, f, g:(A
(B + Top)). p-disjoint(A;f;g) 
A, B:Type, f, g:(A(B + Top)). p-disjoint(A;f;g) TB(x)
x:A.B(x)x:A. B(x)
T
b
B(x)
A